远程反舰导弹弹道规划研究

以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

反恐兵力分配运筹方法辅助决策研究

将影响兵力分配决策的各主要因素及其相互关系抽象为线性规划数学模型，通过数学模型的求解，可确定最佳兵力分配方案。模型的建立过程可灵活地体现所有主要的现实需要和考虑因素，因而具有广泛的适用性。计算机软件的引入，可瞬问求得最优解，满足实际作战需要。     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

Investment in production resource flexibility: An empirical investigation of methods for planning under uncertainty

We examine several methods for evaluating resource acquisition decisions under uncertainty. Traditional methods may underestimate equipment benefit when part of this benefit comes from decision flexibility. We develop a new, practical method for resource planning under uncertainty, and show that this approach is more accurate than several commonly used methods. We successfully applied our approach to an investment problem faced by a major firm in the aviation information industry. Our recommendations were accepted and resulted in estimated annual savings in excess of $1 million (US). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

飞行器航路规划算法分析

针对现代军用飞行器任务规划系统航路规划的特点,分析了飞行器航路规划的基本要求,阐述了目前国内外应用和研究的几种航路规划算法:A*搜索算法、遗传算法、粒子群算法、数学规划算法、电势理论法等,并对飞行器航路规划算法的发展趋势进行了展望.     

一种开发逻辑程序中AND并行性的静态编译方法

逻辑程序AND并行性的开发是逻辑程序并行执行研究中的一个重要课题。文中提出了一种开发逻辑程序中AND并行性的静态编译方法。该方法分成三个阶段:第一阶段,进入模式(entry mode) 的分析;第二阶段,退出模式(exit mode) 的生成;第三阶段,执行图表达式(execution graphexpression) 的确定。通过运行一些基准程序可知,与其它方法相比,该方法能在“生产者一消费者”原则(producer-consumer scheme) 下最大限度地开发AND并行性,且只需很小的动态开销。     

线性分式规划原始单纯形算法有限性问题

本文用一个数值例子说明用[1] 和[2] 中的原始单纯形算法求解退化的线性分式规划(LFP) 可能会出现基循环,从而得不到最优解。于是就此情形引入了Bland规则,并建立了有限性算法。     

两种选址问题的算法及有关结论

本文提出两种选址问题,对其局部最优性建立了充要条件,并在此基础上提出了该类问题的有效算法。     

基于0-1规划的弹种决策与发射时序优化

对于身管发射武器系统,同一发射单元使用不同弹种完成作战任务时,需要确立合适的弹种决策与最佳的发射时机.提出用O-1变量来描述弹种决策变量.通过时弹种发射机制及武器系统控制特点进行分析,构造多种0-1变量用以描述武器系统作战时序之间的约束关系,建立了弹种发射时序的0-1规划模型,并用LINGO软件实现了0-1规划的求解.给出了典型应用实例,进行了仿真计算,结果表明,该方法简单可行.